11 research outputs found
Uncountable realtime probabilistic classes
We investigate the minimum cases for realtime probabilistic machines that can
define uncountably many languages with bounded error. We show that logarithmic
space is enough for realtime PTMs on unary languages. On binary case, we follow
the same result for double logarithmic space, which is tight. When replacing
the worktape with some limited memories, we can follow uncountable results on
unary languages for two counters.Comment: 12 pages. Accepted to DCFS201
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
It is known that 2-state binary and 3-state unary probabilistic finite
automata and 2-state unary quantum finite automata recognize uncountably many
languages with cutpoints. These results have been obtained by associating each
recognized language with a cutpoint and then by using the fact that there are
uncountably many cutpoints. In this note, we prove the same results for fixed
cutpoints: each recognized language is associated with an automaton (i.e.,
algorithm), and the proofs use the fact that there are uncountably many
automata. For each case, we present a new construction.Comment: 12 pages, minor revisions, changing the format to "dmtcs-episciences"
styl
Possibilities of ultrametric finite automata
MaÄ£istra darbÄ tiek pÄtÄ«ti ultrametriski galÄ«gi automÄti un to iespÄjas. Ultrametriski automÄti ir lÄ«dzÄ«gi varbÅ«tiskiem automÄtiem, tikai varbÅ«tÄ«bu vietÄ tiek izmantotas amplitÅ«das, kas ir p-adiski skaitļi. PÄdÄjos divos gados tika veikti dažÄdi pÄtÄ«jumi, kuros piedalÄ«jÄs arÄ« darba autors, par ultrametrisku algoritmu izmantoÅ”anas iespÄjÄm, ieskaitot to izmantoÅ”anu galÄ«gajos automÄtos. DarbÄ tiek izpÄtÄ«tas dažÄdu ultrametrisku galÄ«gu automÄtu tipu iespÄjas, salÄ«dzinot tos ar citiem automÄtu tipiem. MaÄ£istra darbÄ tiek salÄ«dzinÄtas dažÄdi definÄtu ultrametrisku galÄ«gu automÄtu valodu atpazÄ«Å”anas iespÄjas. Ultrametriski galÄ«gi automÄti darbÄ tiek salÄ«dzinÄti arÄ« ar dažÄdu sarežģītÄ«bu determinÄtÄm, nedeterminÄtÄm un varbÅ«tiskÄm TjÅ«ringa maŔīnÄm.The masterās work āPossibilities of ultrametric finite automataā explores ultrametric finite automata and their possibilities. Ultrametric automata are similar to probabilistic automata, but instead of probabilities, they use amplitudes, which are p-adic numbers. In the last two years, the author participated in researches about possibilities of use of ultrametric algorithms, including their use in finite automata. The work explores possibilities of different types of ultrametric finite automata comparing them with other types of automata. In the masterās work possibilities of differently defined ultrametric automata to recognize languages are compared. Ultrametric finite automata are also compared with deterministic, nondeterministic and probabilistic Turing machines of different complexities
Multiplayer web-based RPG game
āDaudzlietotÄju tÄ«mekļa RPG spÄleā ā cÄ«Åu spÄles portÄls, kas izstrÄdÄts cilvÄkiem, kam patÄ«k spÄlÄt un sazinÄties ar citiem cilvÄkiem, kÄdu laiku atrodoties mÄkslÄ«gÄ pasaulÄ. TÄ ir laba iespÄja attÄ«stÄ«t savu stratÄÄ£isko domÄÅ”anu un fantÄziju un atrast jaunus draugus. Moderatoriem ir iespÄja kontrolÄt kÄrtÄ«bu portÄlÄ un veidot jaunus ieroÄus un bruÅu. SavukÄrt administrators var pÄrvaldÄ«t moderatorus un spÄlÄtÄjus. SpÄles uzbÅ«ve ļauj projektam augt, bet lietotÄja saskarne paredzÄta Ärtai un intuitÄ«vai pÄrvietoÅ”anai pa projekta sadaļÄm un patÄ«kamÄm cÄ«Åas procesam.āMultiplayer web-based RPG gameā - the fight game portal, designed for people who love to play and communicate with other people, spending some time in an artificial world. It is a good opportunity to develop strategic thinking and imagination and make new friends. Moderators have the opportunity to monitor the discipline on the site and build new weapons and armor. The administrator can manage the moderators and players. Game engine allows the project to grow, but the user interface provides easy and intuitive navigation through the project sections and enjoyable fight process
VarbÅ«tiskÄs skaitļoÅ”anas un pÄrbaudes pÄrÄkums pÄr TjÅ«ringa maŔīnÄm
MÅ«su mÄrÄ·is ir izpÄtÄ«t dažÄdus ierobežotas kļūdas varbÅ«tiskus modeļus, kas spÄj definÄt nesanumurÄjami daudz valodu. MÄs sÄkam ar stingrÄko nosacÄ«jumu - sÄkumÄ apskatÄm minimÄlus modeļus, kas var atpazÄ«t visas valodas. MÄs apskatÄm varbÅ«tiskas TjÅ«ringa maŔīnas, varbÅ«tiskus automÄtus ar skaitÄ«tÄjiem un varbÅ«tiskus galÄ«gus automÄtus ar dažÄdiem ierobežojumiem uz ievadgalviÅu. MÄs apskatÄm arÄ« konstantas telpas pÄrbaudÄ«tÄjus (verifiers), kas mijiedarbojas ar vienu un diviem pierÄdÄ«tÄjiem (provers) un pÄrbauda (verify) visas valodas. PÄc tam mÄs pieminÄtajos modeļos apskatÄm nesanumurÄjami daudzu valodu atpazÄ«Å”anu un pÄrbaudi ar ierobežotu kļūdu. MÄs pierÄdÄm arÄ« jaunus rezultÄtus par kvantu automÄtu modeļiem un ultrametriskiem galÄ«giem automÄtiem (kuri izmanto p-adiskus skaitļus kÄ amplitÅ«das), kas atpazÄ«st nesanumurÄjami daudz valodu.Our aim is to investigate different bounded-error probabilistic models that can define uncountably many languages. We begin with stronger condition - we first consider minimal models that can recognize all languages. We consider probabilistic Turing machines, probabilistic counter automata, and probabilistic finite state automata with various restrictions on the input head. We also consider constant-space verifiers that interact with one and two provers and verify all languages. After that we consider the recognition and verification of uncountably many languages with bounded error for these models. We also present new results for quantum automata models and ultrametric finite automata (which use p-adic numbers as amplitudes) that recognize uncountably many languages
Ultrametric algorithms for various types of automata
Bakalaura darbÄ tiek apskatÄ«ti p-adiski skaitļi un to izmantoÅ”ana automÄtos par parametriem, kas ļauj veidot ultrametriskus automÄtus. Ultrametriski automÄti ir lÄ«dzÄ«gi varbÅ«tiskiem automÄtiem, tikai varbÅ«tÄ«bu vietÄ tiek izmantotas amplitÅ«das, kas ir p-adiski skaitļi. DarbÄ tiek apskatÄ«tas ultrametrisku algoritmu izmantoÅ”anas iespÄjas atpazÄ«stamo valodu klases paplaÅ”inÄÅ”anai, nepiecieÅ”amo stÄvokļu skaita samazinÄÅ”anai un sarežģītÄ«bas samazinÄÅ”anai. Tiek apskatÄ«ti ultrametriski algoritmi galÄ«giem vienvirziena un divvirzienu automÄtiem, automÄtiem ar magazÄ«nas atmiÅu, automÄtiem ar vairÄkÄm galviÅÄm un TjÅ«ringa maŔīnÄm. DarbÄ ir parÄdÄ«ts, ka determinÄtas TjÅ«ringa maŔīnas uzdevumus var reducÄt uz ultrametriskiem galÄ«giem automÄtiem, kÄ arÄ« pierÄdÄ«tas vairÄkas teorÄmas par dažÄdiem automÄtu tipiem.The bachelor work explores p-adic numbers and their usage in automata as parameters. The use of p-adic numbers allows to make ultrametric automata. Ultrametric automata is similar to probabilistic automata, except that p-adic numbers ā amplitudes are being used instead of probabilities. The work explores the abilities of ultrametric algorithms in the expansion of recognizable languages and reduction of the state count and complexity. Ultrametric algorithms for one-way and two-way automata, pushdown automata, multi-head automata and Turing machines are explored. The work shows that tasks for deterministic Turing machine may be reduced to ultrametric finite automata. Several theorems about various types of automata are proven
Uncountable classical and quantum complexity classes
It is known that poly-time constant-space quantum Turing machines (QTMs) and logarithmic-space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (A.C. Cem Say and A. Yakaryılmaz, Magic coins are useful for small-space quantum machines. Quant. Inf. Comput. 17 (2017) 1027ā1043). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough for PTMs on unary languages in sweeping reading mode or logarithmic space for one-way head. On unary languages, for quantum models, we obtain middle logarithmic space for counter machines. For binary languages, arbitrary small non-constant space is enough for PTMs even using only counter as memory. For counter machines, when restricted to polynomial time, we can obtain the same result for linear space. For constant-space QTMs, we obtain the result for a restricted sweeping head, known as restarting realtime